Differentiated reliability (DiR) in WDM rings without wavelength converters

نویسندگان

  • Andrea Fumagalli
  • Marco Tacca
چکیده

The concept of Differentiated Reliability (DiR) was recently introduced by the authors to provide multiple reliability degrees (or classes) at the same network layer using a common protection mechanism, e.g., path switching. According to the DiR concept, each connection at the layer under consideration is guaranteed a minimum reliability degree, defined as the Maximum Failure Probability allowed for that connection. The reliability degree chosen for a given connection is thus determined by the application requirements, and not by the actual network topology, design constraints, robustness of the network components, and span of the connection. In the paper the DiR concept is applied to designing the Wavelength Division Multiplexing (WDM) layer of a ring network in which wavelength conversion is not available. To solve the routing and wavelength assignment problem at the WDM layer an efficient algorithm is proposed that resorts to reusable protection wavelengths while guaranteeing the required reliability degree of each connection. Lower bounds on the network bandwidth required by two approaches — respectively based on non-reusable and reusable protection wavelengths — reveal interesting properties of the DiR concept and the proposed algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shared path protection with differentiated reliability

In [1], [2] the authors introduced the concept of Differentiated Reliability (DiR) applied to dedicated path protection (DPP) switching in Wavelength Division Multiplexing (WDM) rings. By means of the DiR concept, a network can be designed to provide multiple degrees of reliability and efficiently satisfy the user-specific requirements, yet minimizing the network total cost. This paper extends ...

متن کامل

Resource-efficient path-protection schemes and online selection of routes in reliable WDM networks

The optimal choice of routing and wavelength assignment (RWA) for the working and protection path–pair of the newly generated demand request is often a complex problem in reliable wavelength-division-multiplexed (WDM) networks subject to dynamic traffic. The challenge is twofold: how to provide the required reliability level without over-reserving network resources and how to find a good soluti...

متن کامل

A New Routing Algorithm for Differentiated Reliable Services with Dynamic Link Availability in WDM Mesh Networks

We address the problem of routing and wavelength assignment (RWA) considering differentiated reliability (DiR) in WDM mesh networks. The backup resource can be shared by the primary lightpaths. However, both the primary-backup sharing and the different levels of fault tolerance requirement have never been considered together in the literature. In the paper, we consider the dynamic character of ...

متن کامل

Dynamic segment shared protection algorithm for reliable wavelength-division-multiplexing mesh networks.

With the maturation of the technology of Wavelength-Division-Multiplexing (WDM) in optical networks, the survivable design has become a key issue. In this paper, we propose a Segment Shared Protection Algorithm (SSPA), which is based on the reliability of the networks and the different levels of the fault tolerance requested by the users, to protect the single-link failure in WDM optical networ...

متن کامل

Optimal placement of wavelength converters in trees, tree-connected rings, and tree of rings

In wavelength routed optical networks, wavelength converters can potentially reduce the requirement on the number of wavelengths. A recent study [Proceedings of 9th ACM-SIAM Symposium on Discrete Algorithms (1998)] raised the following problem: choose a minimum number of nodes in a WDM network to place wavelength converters so that any set of paths requires the same number of wavelengths as if ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001